Optimal Real-Time Scheduling Algorithm for harvesting energy environment
نویسندگان
چکیده
منابع مشابه
An Optimal Multiprocessor Real-Time Scheduling Algorithm
An optimal scheduling algorithm is described that feasibly schedules a set of m periodic tasks on n processors before their respective deadlines, if the task set satisses certain conditions. The complexity of this scheduling algorithm in terms of the number of scheduled tasks and the number of processors and upper bounds on the number of preemptions in a given time interval and for any single t...
متن کاملReal-Time Scheduling with DVS and Harvesting Energy Constraints
In real-time embedded system, that must carry their own power source and cannot depends on the power outlet on the wall, apart from feasibly schedule the set of tasks, power management is also the major issue because without power the system is useless. In this paper, we propose a harvesting aware real-time scheduling algorithm with variable speed assignment scheme to set of periodic tasks aims...
متن کاملTask Scheduling in Energy Harvesting Real-time Embedded Systems
Harvesting energy from the environment is very desirable for many emerging applications that use embedded devices. Energy harvesting also known as energy scavenging enables us to guarantee quasi-perpetual system operation for wireless sensors, medical implants, etc. without requiring human intervention which is normally necessary for recharging batteries in classical battery-operated systems. N...
متن کاملToward an Optimal Fixed-Priority Algorithm for Energy-Harvesting Real-Time Systems
This paper addresses the real-time xed-priority scheduling problem for battery-powered embedded systems whose energy storage unit is replenished by an environmental energy source. In this context, a scheduling policy should account for incoming energy, capacity of the battery and tasks cost of energy. Thus, classical xed-priority schedulers are no longer suitable for this model. Some algorithms...
متن کاملAn Optimal Scheduling Algorithm for Distributed Heterogeneous Real-Time Systems
We present a branch-and-bound algorithm to optimally schedule a set of communicating parallel real-time tasks, made up of subtasks, in a distributed heterogeneous computer system. The algorithm generates a search tree and for every tree vertex, corresponding to a partial schedule, it calculates a lower bound on the completion time of the subtasks being considered in that vertex. The algorithm t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2021
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/1116/1/012058